Trade-offs in learning controllers from noisy data
نویسندگان
چکیده
In data-driven control, a central question is how to handle noisy data. this work, we consider the problem of designing stabilizing controller for an unknown linear system using only finite set data collected from system. For problem, many recent works have considered disturbance model based on energy-type bounds. Here, alternative more natural where obeys instantaneous case, existing approaches, which would convert bounds into bounds, can be overly conservative. contrast, without any conversion step, simple arguments S-procedure lead very effective design through convex program. Specifically, feasible latter always larger, and matrices consistent with smaller decreases significantly number points. These findings some computational aspects are examined in numerical examples.
منابع مشابه
Computational Trade-offs in Statistical Learning
Computational Trade-offs in Statistical Learning by Alekh Agarwal Doctor of Philosophy in Computer Science and the Designated Emphasis
متن کاملTrade-offs in Explanatory Model Learning
In many practical applications, accuracy of a prediction is as important as understandability of the process that leads to it. Explanatory learning emerges as an important capability of systems designed for close interaction with human users. Many generic white-box predictive model types are readily available and potentially appropriate for the task (decision trees, association rules, sub-spaci...
متن کاملData compression trade-offs in sensor networks
This paper first discusses the need for data compression within sensor networks and argues that data compression is a fundamental tool for achieving trade-offs in sensor networks among three important sensor network parameters: energy-efficiency, accuracy, and latency. Next, it discusses how to use Fisher information to design data compression algorithms that address the trade-offs inherent in ...
متن کاملIterative Concept Learning from Noisy Data Iterative Concept Learning from Noisy Data
In the present paper, we study iterative learning of indexable concept classes from noisy data. We distinguish between learning from positive data only and learning from positive and negative data; synonymously, learning from text and informant, respectively. Following 20], a noisy text (a noisy informant) for some target concept contains every correct data item innnitely often while in additio...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Systems & Control Letters
سال: 2021
ISSN: ['1872-7956', '0167-6911']
DOI: https://doi.org/10.1016/j.sysconle.2021.104985